Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
نویسندگان
چکیده
منابع مشابه
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems
The paper contributes to the systematic study (started by Berman and Karpinski) of explicit approximability lower bounds for small occurrence optimization problems. We present parametrized reductions for some packing and covering problems, including 3-Dimensional Matching, and prove the best known inapproximability results even for highly restricted versions of them. For example, we show that i...
متن کاملPolynomial time approximation schemes for dense instances of minimum constraint satisfaction
It is known that large fragments of the class of dense Minimum Constraint Satisfaction (MIN-CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to their Maximum Constraint Satisfaction analogs. In this paper we prove, somewhat surprisingly, that the minimum satisfaction of dense instances of kSAT-formulas, and linear equations mod 2, Ek-LIN2, do have PTASs for any k...
متن کاملApproximation schemes for NP-hard geometric optimization problems: a survey
NP-hard geometric optimization problems arise in many disciplines. Perhaps the most famous one is the traveling salesman problem (TSP): given n nodes in<2 (more generally, in<d), find the minimum length path that visits each node exactly once. If distance is computed using the Euclidean norm (distance between nodes (x1, y1) and (x2, y2) is ((x1−x2)+(y1−y2))) then the problem is called Euclidean...
متن کاملPolynomial time approximation of dense weighted instances of MAX-CUT
We give the rst polynomial time approximability characterization of dense weighted instances of MAX-CUT, and some other dense weighted NP-hard problems in terms of their empirical weight distributions. This gives also the rst almost sharp characterization of inapproximability of unweighted 0,1 MAX-BISECTION instances in terms of their density parameter only.
متن کاملPolynomial-time approximation schemes for scheduling problems with time lags
We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1998.1605